Orienteering-based Path Selection for Mobile Sensors

نویسندگان

  • Lorenzo Bottarelli
  • Manuele Bicego
  • Jason Blum
  • Nicola Bombieri
  • Alessandro Farinelli
  • Luca Veggian
چکیده

The goal of information gathering is to obtain data from the environment generating an accurate model for the application of interest. In many applications the information gathering process requires to obtain measurement of the phenomena of interest in harsh or dangerous conditions (e.g., environmental monitoring applications of water in a lake or search and rescue operations in disaster response). Moreover, in recent years, the interest towards robotic sensors such as Unmanned Ground Vehicles (UGVs), Unmanned Aerial Vehicles (UAVs) or Autonomous Surface Vessels (ASVs) for information gathering application is steadily increasing. For example, in the context of environmental monitoring a successful monitoring operation must acquire large datasets to build an accurate model of the environmental phenomena of interest. For an exhaustive overview on advancements and applications of mobile sensors for environmental monitoring see [3]. Moreover, in the context of aerial monitoring, Unmanned Aerial Vehicles (UAVs), which can fly autonomously at low altitude, are an emerging technology being adapted for a wide range of applications such as remote sensing, scientific research, and search and rescue tasks [9, 10, 15]. In general, when using mobile robotic systems, different path selection strategies could be identified [12]. Offline strategies rely on a predefined path for the agent that is independent from the data that the sensors read. Conversely, using online strategies, the path selection procedure is dependent on the data that has been previously collected from the sensor. In this work we show two different applications for online path selection procedures that rely on a common orienteering formulation. Specifically the contribution is to highlight the formulation of the orienteering problem in the context of information gathering through the use of mobile sensors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Skeleton-Based Orienteering for Level Set Estimation

In recent years, the use of unmanned vehicles for monitoring spatial environmental phenomena has gained increasing attention. Within this context, an interesting problem is level set estimation, where the goal is to identify regions of space where the analyzed phenomena (for example the PH value in a body of water) is above or below a given threshold level. Typically, in the literature this pro...

متن کامل

A Cellular Automaton Based Algorithm for Mobile Sensor Gathering

In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...

متن کامل

Dynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)

In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...

متن کامل

Increasing Localization Precision in Sensor Networks with Mobile Beacons – a Genetic Path Planning Approach

This work describes a genetic algorithm based approach to approximate an optimal path for a mobile beacon node in a grid of stationary wireless sensors. As the beacon moves over the field of sensors it broadcasts its location. Sensors that are currently in the proximity of the beacon will receive this communication and can then use several of these messages to compute estimates on their locatio...

متن کامل

Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing

We develop polynomial-size LP-relaxations for orienteering and the regret-bounded vehicle routing problem (RVRP) and devise suitable LP-rounding algorithms that lead to various new insights and approximation results for these problems. In orienteering, the goal is to find a maximum-reward r-rooted path, possibly ending at a specified node, of length at most some given budget B. In RVRP, the goa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016